A Detector Generating Algorithm Based on Interval Partition
نویسندگان
چکیده
منابع مشابه
A partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملA Travel Time Fusion Algorithm Based on Point and Interval Detector Data
Up to now studies on the fusion of travel time from various detectors have been conducted based on the variance ratio of the intermittent data mainly collected by GPS or probe vehicles. The fusion model based on the variance ratio of intermittent data is not suitable for the license plate recognition AVIs that can deal with vast amount of data. This study was carried out to develop the fusion m...
متن کاملGenerating Class Models using Binary Space Partition Algorithm
In this paper, we address a challenging task of automat generation of UML class models. In conventional CASE tools, the export facility does not export the graphical information that explains the way UML class elements (such as classes, associations, etc) are represented and laid out in diagrams. We address them problem by presenting a novel approach for automatic generation of UML class diagra...
متن کاملSuboptimal MIMO Detector based on Viterbi Algorithm
Suboptimal detectors of multiple-input multiple-output (MIMO) have been studied because the implementation of the optimum detector, the maximum-likelihood (ML) detector, has so far been considered infeasible for high-rate system. Sphere decoder (SD) using depth-first tree searching and K-best algorithm are used for near optimum detector. SD has the non-deterministic computational throughput and...
متن کاملA partition-based global optimization algorithm
This paper is devoted to the study of partition-based deterministic algorithms for global optimization of Lipschitz-continuous functions without requiring knowledge of the Lipschitz constant. First we introduce a general scheme of a partition-based algorithm. Then, we focus on the selection strategy in such a way to exploit the information on the objective function. We propose two strategies. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2009
ISSN: 1550-1477,1550-1477
DOI: 10.1080/15501320802520605